weighted graph
英 [ˈweɪtɪd ɡræf]
美 [ˈweɪtɪd ɡræf]
网络 带权图; 加权图; 赋权图; 权图; 加权有向图
双语例句
- In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.
本文将网格分区问题转化为无向赋权图的分区，在图上研究分区算法。 - Based on the software architecture, proposed weighted graph based evaluation model for complexity, with an example to be analyzed and explained how to use the model.
在该结构基础上，提出了基于加权图的复杂性评价模型，并结合实例分析了模型的使用效果。 - Firstly, a weighted completed graph is constructed for each point set;
首先，对相关点集构造赋权完全图； - The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm.
对求无向赋权图最小生成树两种算法分别是PRIM算法和KRUSKAL算法。 - In this paper explore how to use spectral methods of geometry structural graph for analyzing facial expression and clustering in the pattern-space. Use the leading eigenvectors of the weighted graph adjacency matrix to define eigenmodes of the adjacency matrix.
文中探索用人脸的几何结构图谱方法嵌入到模式空间来分析人脸表情，以图的加权邻接矩阵主要特征向量来定义矩阵的特征模。 - Simulated annealing algorithm for K-vertex-connected augmentation on the arbitrary undirected weighted graph
任意无向加权图K点连通扩充的模拟退火算法 - Secondly, given the shortest time limit, construct the bipartite weighted graph and use the minimum weighted assignment algorithm to get the solution.
第二步在已求得的最短时限下，构造带权二分图，使用最小带权二分图指派算法求解，得到最短时限下的最少耗费指派解。 - Spatio-Temporal Data Model in Cadastral Information System Based on Weighted Graph
基于加权图的地籍时空数据描述模型研究 - In Chapter 3, we prove that: Suppose G is a k-connected weighted graph which satisfies the following conditions: ( 1) The weighted degree sum of any k+ 1 pairwise nonadjacent vertices is at least m;
在第三章里，我们证明了：假设G是一个满足k≥2的k连通赋权图。如果G满足以下条件：（1）任意k+1个相互独立的顶点的赋权度和至少为m； - A New Solution to the Shortest Path Problem of Weighted Graph
简单赋权图最短路问题的一种新解法 - Analysis of Structure and Algorithms of the Gravity Center on a Complete Weighted Graph
完全赋权图重心的结构分析与算法 - A Decomposition Method for Object-Oriented Systems Based on Iterative Analysis of the Directed Weighted Graph
基于有向带权图迭代的面向对象系统分解方法 - The surface painting of rotor and the place of optoelectronic sensors were analyzed, the commuting strategy can be attained and therefore the spherical stepper can be controlled to achieve the expected trajectory according to the algorithm of the weighted graph and the signal feedback from optoelectronic sensors.
根据转子表面的编码原理，采用图中路径搜索算法，最终通过光电传感器反馈的信号确定永磁球形步进电动机的通电线圈对，实现闭环控制球形步进电动机。 - This paper presents the directed weighted graph of semijoin in order to optimize semijoin execution plan. Furthermore, the fast and effective optimization algorithm is presented in order to produce optimum semijoin execution plan based on directed weighted graph of semijoin.
在对半连接执行方案进行优化时，提出了半连接加权有向图的概念，并给出了针对半连接加权有向图的半连接执行方案的快速有效的优化算法。 - An algorithm is presented, uses the algorithm to transform the model into the weighted graph, and constructs the linking matrix.
本文给出了一种构造算法，把障碍环境模型转换成熟悉的带权图，同时构造出了图中各顶点间的邻接矩阵。 - An approximation algorithm is presented for augmenting an undirected weighted graph to a K-edge-connected graph. The algorithm is useful for designing a realizable network.
本文研究了以最小或近似最小权值的边集扩充一个任意无向加权图为K边连通图，文中给出了一个近似算法，为网络的可靠性设计和改建提供了一个新方法。 - Discussions about the Two Algorithms for Finding the Minimal Spanning Tree of an Undirected Weighted Graph
求无向赋权图最小生成树的两种算法的探讨 - The control ofa permanent magnet spherical stepper motor based on weighted graph
基于加权无向图的永磁球形步进电机运动控制 - The surface painting of rotor and the place of optoelectronic sensors, and then a weighted graph is given according to the structural characteristics and kinetics characteristics of the stepper.
介绍了该永磁球形步进电机定子、转子的结构，电机转子表面的着色原理以及电机定子上的光电传感器的放置； - After analyzing the existing identification algorithms, the paper proposed Iterative analysis algorithms based on the Directed weighted graph for Domain Component Identification ( IADCI);
并在分析现有标识算法的基础上，提出了一种基于有向带权图迭代分析的领域构件标识算法（IADCI）； - A motion control algorithm based on the weighted graph is presented, by which the path planning can be completed and the spherical motor can be controlled to achieve the expected trajectory.
同时提出一种基于加权无向图的运动控制算法，通过对路径进行搜索，实现了对电机通电状态的有效控制，达到了沿着期望运动轨迹运动的目的。 - In the article, the hypertext system is regarded as a weighted graph and the composite association rule mining method is proposed after the redefinition of the confidence and support.
将超文本系统看成是一种有向加权图，经过对可信度和支持度的重新定义，使之适合于用来表示用户的访问路径，并引出复合关联规则挖掘算法。 - And then the control method based on weighted graph was presented.
然后提出了一种基于加权无向图的控制方法。 - The typical Dijkstra algorithm is used to solve the shortest path of single source point in weighted graph, and is not able to solve the above model directly.
经典Dijkstra算法是解决带权图中的单源点最短路径问题的，不能直接求解平面障碍环境中的最短路径规划问题。 - Simulation results showed that the Petri net method is efficient to calculate the maximum flow of the weighted graph.
仿真结果表明，Petri网方法是一种有效的计算加权图最大流量的方法。 - Finally, the definition of high connectivity graph was extended to be used in undirected weighted graph, and was taken as termination criteria for graph partitioning.
对高连通图的定义进行引申后，用于无向有权图中，并将高连通图的判据作为图分割的终止判据。 - As a result, a video can be seen as a weighted graph in a high-dimensional space, in which the classical graph theory can be applied.
由此，视频可以看作高维空间里的一个权重图，图论的经典理论便可以应用其中。 - By modeling the memory hierarchy as a weighted graph, our method is applicable to any software-managed memory hierarchy organization.
通过将存储层次建模为一个带权图，我们的方法可以运用到任何多级软件管理存储层次组织上。 - It trains semi-machine learning algorithm in a weighted graph made up of labeled and unlabeled web pages. It makes full use of the information of the unlabeled pages.
该方法通过在标签网页和未标签网页为顶点组成的无向带权图上进行半监督学习，充分利用未标签样本的信息。 - And generate a directed weighted graph, intuitive picture of the world arms trade situation. 3.
并生成一个有向加权图，直观展示世界武器贸易状况。